Number 3
نویسنده
چکیده
Modification of a digital image by adding or removing some of its elements using a wide variety of image processing tools results in image forgery. As a result authentication of originality of a digital image is becoming a challenging task. Copy-paste forgery is one of the forgeries belonging to context based forgery. Copy-Paste Forgery Detection (CPFD) aims at finding regions that have been copied and pasted within the same or different image. A small change in the image may change statistical parameters that can be analysed for initial assessment of the forgery. In the present research study, a parametric forgery detection model using non-overlapping block-based technique is developed to ascertain the copy-paste forgery in a given digital image. Statistical parameters of the input image are computed, analysed and compared with those of the forged image. The results show that the proposed model identifies the forged area of the given image and works well with low to moderate copy-paste forgery. The results obtained can be used as the initial verification of the images for forgery and to enhance the forgery detection process by identifying most likely cases of possible image forgeries. The proposed model is tested with large domain of images having different dimensions and for
منابع مشابه
The 3-colored Ramsey number for a 3-uniform loose path of length 3
The values of hypergraph 2-color Ramsey numbers for loose cycles and paths have already been determined. The only known value for more than 2 colors is R(C 3 ; 3) = 8, where C 3 3 is a 3-uniform loose cycle of length 3. Here we determine that R(P 3 3 ; 3) = 9, where P 3 3 is a 3-uniform loose path of length 3. Our proof relies on the determination of the Turán number ex3(9;P 3 3 ). We also find...
متن کاملCut Numbers of 3 - Manifolds
We investigate the relations between the cut number, c(M), and the first Betti number, b1(M), of 3-manifolds M. We prove that the cut number of a “generic” 3-manifold M is at most 2. This is a rather unexpected result since specific examples of 3-manifolds with large b1(M) and c(M) ≤ 2 are hard to construct. We also prove that for any complex semisimple Lie algebra g there exists a 3-manifold M...
متن کاملTurán Numbers for 3-Uniform Linear Paths of Length 3
In this paper we confirm a special, remaining case of a conjecture of Füredi, Jiang, and Seiver, and determine an exact formula for the Turán number ex3(n;P 3 3 ) of the 3-uniform linear path P 3 3 of length 3, valid for all n. It coincides with the analogous formula for the 3-uniform triangle C3 3 , obtained earlier by Frankl and Füredi for n > 75 and Csákány and Kahn for all n. In view of thi...
متن کاملThe circular chromatic number of series-parallel graphs of large odd girth
In this paper, we consider the circular chromatic number c (G) of series-parallel graphs G. It is well known that series-parallel graphs have chromatic number at most 3. Hence their circular chromatic number is also at most 3. If a series-parallel graph G contains a triangle , then both the chromatic number and the circular chromatic number of G are indeed equal to 3. We shall show that if a se...
متن کاملOn the maximum number of edges in a hypergraph with given matching number
The aim of the present paper is to prove that the maximum number of edges in a 3-uniform hypergraph on n vertices and matching number s is max {(3s+ 2 3 ) , ( n 3 ) − ( n− s 3 )} for all n, s, n ≥ 3s+ 2.
متن کاملThe Exact Turán Number of F(3, 3) and All Extremal Configurations
If H is a 3-graph, then ex(n;H) denotes the maximum number of edges in a 3-graph on n vertices containing no sub-3-graph isomorphic to H. Let S(n) denote the 3-graph on n vertices obtained by partitioning the vertex set into parts of sizes ⌈ n 2 ⌉ and ⌊ n 2 ⌋ and taking as edges all triples that intersect both parts. Let s(n) denote the number of edges in S(n). Let F (3, 3) denote the 3-graph {...
متن کامل